Cyclic redundancy check modification for message length detection and error detection

ABSTRACT

In a method for a variable-length communications system including encoding a message and decoding a data bit stream, the message includes a plurality of message blocks. A message block of the message is encoded by generating a parity check bit stream, flipping the parity check bit stream, and appending the flipped parity check bit stream to the end of the message block. When a data bit stream is received, a guessed message block and a guessed flipped parity check bit stream are extracted based on a guessed message block length. A parity check bit stream is generated for the guessed message block and then flipped. If the flipped parity check bit stream is the same as the guessed flipped parity check bit stream, the message block has been identified. Otherwise, the guessed message block length is increased by 1 and the above step is repeated.

FIELD OF THE INVENTION

This invention is in general related to a cyclic redundancy check method for message length detection in a variable-length communications system and, more particularly, to a modified cyclic redundancy check method that has a low false detection probability.

BACKGROUND OF THE INVENTION

In a digital communications system, such as a CDMA (Code Division Multiple Access) system, a data bit stream comprising a stream of binary bits representing a message is transmitted by a transmitter, travels through a data channel, and is received by a receiver. The data bit stream is generally composed of a number of message blocks. If the length of a message block is not fixed, the system may be referred to as a variable-length communications system. In such a variable-length system, additional length information of each message block is generally required for the receiver to identify each message block and extract the message from the received data bit stream. A conventional method of a variable-length communications system designates a separate channel as a control channel for transmitting length information of each message block. Thus, when the receiver receives both the length information and the data bit stream, the receiver identifies the corresponding message blocks based on the length information, and de-blocks the data bit stream.

The conventional method also generally utilizes cyclic redundancy check (CRC) bits for error detection purposes. In particular, a fixed number of CRC bits are appended to the end of each message block and have a predetermined relationship with the corresponding message block. The receiver receives both the message block and the CRC bits following that message block, and tries to re-establish the relationship therebetween. If the relationship is satisfied, the message block is considered without error. Otherwise, an error has occurred during the transmission of that block. This method is further explained in greater detail below.

First, a CRC generating polynomial, g_(l)(x), of order l, is chosen. A common way of choosing the CRC generating polynomial is that g_(l)(x) should satisfy gcd(g_(l)(x),x^(i))=1 for each and every i between 0 and l, inclusive, wherein l and i are integers, and the function gcd(A(x),B(x)) is defined as the greatest common divider of polynomials A(x) and B(x). Examples of suitable g_(l)(x) include g₄(x)=x⁴+x³+x²+x+1 for l=4; g₇(x)=x⁷+x⁶+x⁴+1 for l=7; g₈(x)=x⁸+x⁷+x⁴+x³+x+1 for l=8; and g₁₂(x)=x¹²+x¹¹+x³+x²+x+1 for l=12. The information of CRC generating polynomial is stored in both the transmitter and the receiver.

For illustration purposes, a binary polynomial is defined for each binary bit stream as follows: if a binary bit stream A includes t binary bits, a_(t−1), a_(t−2), . . . , a₀, wherein t is an integer, the binary polynomial of A is denoted as A(x) and A(x)=a_(t−1)x^(t−1)+a_(t−2)x^(t−2)+ . . . +a₀. Also for illustration purposes, binary bit stream A is said to satisfy the CRC condition if A(x) is divisible by g_(l)(x). Two binary bit streams A and B are said to satisfy the CRC condition if x^(s)A(x)+B(x) is divisible by g_(l)(x), wherein s is the number of bits contained in bit stream B. It is well known to one skilled in the art that when, for example, a polynomial A(x) is divisible by another polynomial g_(l)(x), remainder of A(x) divided by g_(l)(x) is 0, and it may be said that g_(l)(x) divides A(x), denoted as g_(l)(x)|A(x).

Next, for a message block M containing k bits of binary information, m_(k−1), m_(k−2), . . . , m₀, a parity check bit stream P including l parity check bits, or CRC bits, p_(i−1), p_(t−2), . . . , p₀, is generated such that M and P satisfy the CRC condition, or g_(l)(x)|(x^(l)M(x)+P(x)). A parity check bit stream may also be called a parity block, a parity check block, or a CRC block. For each message block M, it may be proved that there is only one corresponding parity check bit stream P. The proof is understood by one skilled in the art and is not discussed in detail herein.

According to the standard CRC method, parity check bit stream P may be generated using either hardware or software. Examples of hardware implementations are shown in FIGS. 1–2, and an example of a software implementation is shown in FIG. 3. Both FIGS. 1 and 2 assume l=8 and CRC generating polynomial g_(l)(x)=x⁸+x⁷+x⁴+x³+x+1.

FIG. 1 illustrates a first hardware implementation of generating parity check bit stream P. Referring to FIG. 1, a feedback shift register circuit 100 is used for generating parity check bit stream P based on CRC generating polynomial g_(l)(x)=x⁸+x⁷+x⁴+x³+x+1. Circuit 100 includes a plurality of delay circuits 102, which may be implemented as flip-flops. The number of delay circuits 102 is equal to the order of g_(l)(x), i.e., l=8. Thus, in FIG. 1, there are 8 delay circuits, 102 ₁, 102 ₂, . . . , 102 ₈. Several XOR gates 104 are inserted between delay circuits 102. Each XOR gate 104 corresponds to a coefficient of CRC generating polynomial g_(l)(x). For example, as shown in FIG. 1, an XOR gate 104 ₁ to the left side of the first delay circuit 102 ₁ indicates that the coefficient of x⁰=1 of g_(l)(x) is 1; the absence of XOR gate 104 between delay circuits 102 ₂ and 102 ₃ indicates that the coefficient of x² of g_(l)(x) is 0; and an XOR gate 104 ₅ between delay circuits 102 ₇ and 102 ₈ indicates that the coefficient of x⁷ of g_(l)(x) is 1. A clock signal (not shown) shifts register circuit 100 from left to right one bit at a time. Also shown in FIG. 1 is that the output of delay circuit 102 ₈ is fed back to each of XOR gates 104 ₁–104 ₅. The parity check bit stream P is generated by feeding into the left side of circuit 100 the message block M followed by eight bits of 0. The output of delay circuit 102 ₈ then comprises message block M followed by its corresponding parity check bit stream P.

A second hardware implementation of generating parity check bit stream is illustrated in FIG. 2. Similarly, a feedback shift register circuit 200 includes a plurality of delay circuits 202, each of which may be implemented as a flip-flop circuit. Several XOR gates 204 are inserted between delay circuits 202 according to CRC generating polynomial g_(l)(x). However, as compared to FIG. 1, an XOR gate 204 is added to the right end of circuit 200, rather than the left end of circuit 200, and the message block M is input into the rightmost XOR gate 204. A switch 206 switches the output of feedback shift register circuit 200 between message block M and the output of the rightmost XOR gate 204. Feedback shift register circuit 200 first outputs message block M and then outputs the parity bits by switching switch 206 to the output of the rightmost XOR gate 204.

FIG. 3 illustrates a software implementation of generating parity check bit stream P. Rather than generating the parity check bit stream P bit by bit, a lookup table is used in the software implementation. The lookup table contains an entire list of CRC bit streams for all possible messages of a certain length. For example, when l=8, the lookup table includes 2⁸=256 entries of CRC bit streams, each bit stream containing eight binary bits. As shown in FIG. 3, a message including 3 bytes (24 bits), Byte 1, Byte 2, and Byte 3, is encoded using the lookup table. At step 302, Byte 1 is considered and the lookup table is searched for a matching entry for Byte 1. An XOR operation is performed on the outcome of the search and Byte 2 at step 304 to generate an intermediate CRC bit stream CRC 2. An entry that matches CRC2 is looked up in the lookup table (step 306) and is XOR'ed with Byte 3 (step 308), to generate the CRC bit stream, CRC 3, of the message.

The above three implementations will be readily understood by one skilled in the art and, therefore, the details thereof are not further discussed herein.

After the parity check bit stream P is generated, the parity check bits thereof are appended to the end of the message block M to form a concatenated bit stream C including k+l bits, m_(k−), m_(k−2), . . . , m₀, p_(l−1), p_(l−2), . . . , p₀. In view of the above conditions, g_(l)(x) divides C(x)=x^(l)M (x)+P(x).

For each message block contained in the message, the above encoding process is repeated to generate a corresponding concatenated bit stream, and a data bit stream including the concatenated bit streams and length information of each message block are then transmitted through a data channel and a control channel, respectively.

At the receiver side, both the data bit stream and the length information are received. A received message block M′ and a parity check bit stream P′ are extracted based on the length information, wherein M′ includes k bits, m′_(k−1), m′_(k−2), . . . , m′₀, and P′ includes l bits, p′_(l−1), p′_(l−2), . . . , p′₀. The receiver then performs a so-called CRC test to determine if M′ and P′ satisfy the CRC condition. If the condition is satisfied, then the message block is received with no error.

A system using a separately designated control channel for transmitting length information as discussed above could be very inefficient when the data rate is slow. For example, in a standard UMTS (universal mobile telecommunications system) WCDMA (wideband code division multiple access) mode, AMR (Adaptive Multi-Rate) 12.2 kbps mode, the overhead for transmitting the length information may be as large as 3 kbps, or almost 25% of the total transmission rate of 12.2 kbps.

To reduce the overhead incurred by separately transmitting the length information, there has been proposed a CRC method (hereinafter “standard CRC method”) that uses the CRC bits for message length detection, rather than transmitting the length information of each message block through a separate channel. According to the standard CRC method, the transmitter only transmits the data bit stream, and the receiver receives the data bit stream with no length information. Thus, the receiver may not directly identify the message blocks or extract the message. Instead, the receiver repeats a trial-and-error step to search the received data bit stream for a pair of message block and parity check bit stream that satisfy the CRC condition. First, the receiver guesses a number, for example, {circumflex over (k)}, as the block length, and treats the first {circumflex over (k)} bits of the received bit stream as the message block, and the following l bits as parity check bit stream. The receiver then performs the CRC test to determine if the guessed message block and the guessed parity check bit stream satisfy the CRC condition. If the result is affirmative, the receiver has successfully identified a message block and continues to identify the next message block. Otherwise, the message block has not been identified, the guessed block length {circumflex over (k)} is increased by 1, and the CRC test is repeated. Theoretically, after a few trials, the correct message block will be identified.

However, the standard CRC method has an inherent problem of probable false detection. Assuming a noise-free transmission and a uniformly distributed message, the probability of a false detection by the standard CRC method is given by Expression (1):

$\begin{matrix} {{P_{F}(i)} = \left\{ \begin{matrix} 0 & {{{{for}\mspace{14mu} i} = 0};} \\ {2^{- i},} & {{{{for}\mspace{14mu} 1} \leq i \leq {l - 1}};} \\ {2^{- i},} & {{{{for}\mspace{14mu} i} \geq l},} \end{matrix} \right.} & (1) \end{matrix}$

wherein i=k−{circumflex over (k)} is the message length offset. A brief explanation of Expression (1) is provided below.

Since the transmission is assumed noise-free, all the bits transmitted are received without error. Therefore, if i=k−{circumflex over (k)}=0, the CRC condition is satisfied and a correct message block is identified. No false detection occurs, i.e., P_(F)(0)=0.

If i=k−{circumflex over (k)}=1, the wrongly guessed message block M′ includes k−1 bits, m_(k−1), m_(k−2), . . . , m₁, and the guessed parity block P′ includes l bits, m₀, p_(l−1), p¹⁻², . . . , p₁. The CRC test therefore decides whether g_(l)(x) divides

$\begin{matrix} {{C^{\prime}(x)} = {{x^{l}{M^{\prime}(x)}} + {P^{\prime}(x)}}} \\ {= {{m_{k - 1}x^{l + k - 2}} + {m_{k - 2}x^{l + k - 3}} + \ldots + {m_{1}x^{l}} + {m_{0}x^{l - 1}} +}} \\ {{p_{l - 1}x^{l - 2}} + {p_{l - 2}x^{l - 3}} + \ldots + {p_{1}.}} \end{matrix}$ Because gcd(g_(l)(x),x)=1, deciding whether g_(l)(x)|C′(x) is equivalent to deciding whether g_(l)(x)|xC′(x). Comparing C′(x) with C(x), there is xC′(x)=C(x)−p₀. Thus, if p₀=0, because g_(l)(x)|C(x), then g_(l)(x)|xC′(x), and g₁(x)|C′(x). The receiver regards the wrong message block M′ as the correct message block, and there is a false detection. Otherwise, if p₀=1, the CRC condition is not satisfied, the receiver concludes that M′ is not the correct message block, and there is no false detection. For a uniformly distributed message, the probability of p₀=0 is ½, and, therefore, the probability of a false detection is ½.

Similarly, if 1<i≦i−1, the wrongly guessed message block M′ includes k−i bits, m_(k−1), m_(k−2), . . . , m_(i), and the wrongly guessed parity block P′ includes l bits, m_(i−1), m_(i−2), . . . , m₀, p_(i−1), p_(i−2), . . . , p_(i). The CRC test therefore decides whether g_(l)(x) divides

$\begin{matrix} {{C^{\prime}(x)} = {{x^{l}{M^{\prime}(x)}} + {P^{\prime}(x)}}} \\ {= {{m_{k - 1}x^{l - i + k - 1}} + {m_{k - 2}x^{l - i + k - 2}} + \ldots + {m_{0}x^{l - i}} +}} \\ {{p_{l - 1}x^{l - i - 1}} + {p_{l - 2}x^{l - i - 2}} + \ldots + {p_{i}.}} \end{matrix}$ Comparing C′(x) with C(x), there is

${x^{i}{C^{\prime}(x)}} = {{C(x)} - {\sum\limits_{j = 0}^{i - 1}{{p_{j}(x)}.}}}$ Because the order of g_(l)(x), l, is greater than i, g_(l)(x) does not divide

${\sum\limits_{j = 0}^{i - 1}{p_{j}(x)}},$ unless p₀=p₁= . . . =p_(i−1)=0. Further because g_(l)(x)|C(x), and gcd(g_(l)(x),x^(i))=1, g_(l)(x)|C′(x) is satisfied only when p₀=p₁= . . . =p_(i−1)=0. Thus, the probability of a false detection when 1<i≦l−1 is equal to the probability of p₀=p₁= . . . =p_(i−1)=0, which, for a uniformly distributed message, is 2^(−i).

Finally, if i≧l, the guessed message block M′ includes k−i bits, m_(k−1), m_(k−2), . . . , m_(i), and the guessed CRC bit stream P′ includes, m_(i−1), m_(i−2), . . . , m_(i−l). Since there is only one possible CRC bit stream that corresponds to M′, the probability of P′ satisfying the CRC condition of g_(l)(x)|(x^(l)M′(x)+P′(x)), i.e., the probability of a false detection, is 2^(−l) for a uniformly distributed message block.

FIG. 4 shows a simulation result of the probability of passing the CRC test for the standard CRC method with different guessed message lengths. The simulation conditions include that the order of the CRC generating polynomial is 8 and that the actual message length is 15. As shown in FIG. 4, as the estimated message size approaches the actual message length, i.e., the length offset i approaches 0, the probability of passing the CRC test increases exponentially.

In view of the large probability of false detection for a standard CRC method, a modified CRC method with a reduced probability of false detection has been proposed by NTT DoCoMo, Inc., and may be referred to as the DoCoMo's Modification of the CRC method. According to the DoCoMo's Modification, after the parity check bit stream P is generated, the parity check bits are appended to the message block in a reversed order, to form a concatenated bit stream, m_(k−1), m_(k−2), . . . , m₀, p₀, p₁, . . . , p_(i−1). FIG. 5 shows simulation results for the DoCoMo's Modification as compared to the standard CRC method. The conditions are the same as those in FIG. 4, i.e., the order of the CRC generating polynomial is 8 and the actual message length is 15. As shown in FIG. 5, the probability of passing the CRC test, i.e., the probability of false detection is reduced to 2^(−l) for all message length offset i>0.

SUMMARY OF THE INVENTION

The present invention provides for a modified CRC method for message length detection having a low probability of false detection.

In accordance with the present invention, there is provided a method for a variable-length communications system, wherein messages to be transmitted are divided into variable-length message blocks. The method includes providing a cyclic redundancy check (CRC) generating polynomial, providing a binary flip polynomial, and encoding a message block of a message to be transmitted. The message block is encoded by generating a parity check bit stream using the CRC generating polynomial, flipping the parity check bit stream to generate a flipped parity check bit stream using the flip polynomial, and appending the flipped parity check bit stream to the end of message block to create a concatenated bit stream.

In accordance with the present invention, there is also provided a method for a variable-length communications system, wherein the system includes a receiver. The method includes storing in the receiver information of a cyclic redundancy check (CRC) generating polynomial and information of a flip polynomial, receiving a data bit stream including a plurality of concatenated bit streams, each concatenated bit stream consisting of a message block and a corresponding flipped parity check bit stream; and identifying a first message block in the data bit stream. The first message block is identified by (a) guessing a message block and a flipped parity check bit stream at the beginning of the data bit stream, (b) generating a parity check bit stream for the guessed message block using the CRC generating polynomial, (c) flipping the parity check bit stream using flip polynomial to generate a flipped parity check bit stream, and (d) if the flipped parity check bit stream and the guessed flipped parity check bit stream are different, increasing {circumflex over (k)} by 1 and repeating steps (a)–(c).

In accordance with the present invention, there is further provided a method for a variable-length communications system including encoding a message and decoding a data bit stream, wherein the message includes a plurality of message blocks. A message block of the message is encoded by generating a parity check bit stream, flipping the parity check bit stream, and appending the flipped parity check bit stream to the end of the message block. When a data bit stream is received, a guessed message block and a guessed flipped parity check bit stream are extracted based on a guessed message block length. A parity check bit stream is generated for the guessed message block and then flipped. If the flipped parity check bit stream is the same as the guessed flipped parity check bit stream, the message block has been identified. Otherwise, the guessed message block length is increased by 1 and the above step is repeated.

Additional features and advantages of the invention will be set forth in part in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention. The features and advantages of the invention will be realized and attained by means of the elements and combinations particularly pointed out in the appended claims.

It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the invention, as claimed.

BRIEF DESCRIPTION OF THE DRAWINGS

The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments of the invention and, together with the description, serve to explain the objects, advantages, and principles of the invention.

In the drawings,

FIG. 1 illustrates a first hardware implementation of generating a parity check bit stream according to the standard CRC method;

FIG. 2 illustrates a second hardware implementation of generating a parity check bit stream according to the standard CRC method;

FIG. 3 illustrates a software implementation of generating a parity check bit stream according to the standard CRC method;

FIG. 4 shows simulation results of the standard CRC method;

FIG. 5 shows simulation results of the DoCoMo Modification of the CRC method;

FIG. 6 illustrates a first hardware implementation of generating a flipped parity check bit stream according to the present invention;

FIG. 7 illustrates a second hardware implementation of generating a flipped parity check bit stream according to the present invention;

FIG. 8 illustrates a software implementation of generating a flipped parity check bit stream according to the present invention; and

FIG. 9 shows simulation results of the present invention as compared to the standard CRC method and the DoCoMo's Modification method.

DESCRIPTION OF THE EMBODIMENTS

Reference will now be made in detail to preferred embodiments of the invention, examples of which are illustrated in the accompanying drawings. Wherever possible, the same reference numbers will be used throughout the drawings to refer to the same or like parts.

Embodiments consistent with the present invention provide a modified CRC method for message length detection having a low probability of false detection. More particularly, methods consistent with the present invention have a zero probability of false detection for any message length offset that is less than the number of CRC bits utilized in the system for each message block.

Methods consistent with the present invention are suitable for use in a variable-length communications system, which includes a transmitter and a receiver. A message to be transmitted may include a number of message blocks having non-fixed lengths. Each message block is encoded and transmitted by the transmitter. When the receiver receives the encoded message blocks, each message block is decoded and the message is extracted. Since the method of encoding and decoding is the same for all the message blocks, only one message block M including k bits, m_(k−1), m_(k−2), . . . , m_(k−1), m₀, is considered in the following description.

For illustration purposes, a binary polynomial is defined for each binary bit stream as follows: if a binary bit stream A includes t binary bits, a_(t−1), a_(t−2), . . . , a₀, wherein t is an integer, the binary polynomial of A is denoted as A(x) and A(x)=a_(t−1)x^(t−1)+a_(t−2)x^(t−2)+ . . . +a₀. It is assumed that, unless otherwise indicated, hereinafter, when two binary polynomials are added, coefficients of the two polynomials corresponding to the same power are added according to a modulo-2 addition operation. A modulo-2 addition is defined as a binary addition with no carry, for example, 0+1=1, and 1+1=0. Thus, if bit stream B includes s binary bits, b_(s−1), b_(s−2), . . . , b₀, then, assuming s<t, A(x)+B(x)=a _(t−1) x ^(t−1) +a _(t−2) x ^(t−2) + . . . +a _(s) x ^(s)+(a _(s−1) +b _(s−1))x ^(s−1)+(a _(s−2) +b _(s−2))x ^(s−2)+ . . . +(a ₀ +b ₀), wherein a_(i)+b_(i) gives the result of modulo-2 addition of a_(i) and b_(i), for 0≦i≦s−1. It also assumed that, unless otherwise indicated, hereinafter, when two binary bit streams are added, the corresponding bits of the two bit streams are added according to modulo-2 addition operation. It is also well known to one skilled in the art that, according to the definition of modulo-2 addition, there are a+b+b=a, A+B+B=A, and A(x)+B(x)+B(x)=A(x), wherein a and b are binary bits, and A and B are binary bit streams.

A method consistent with the present invention starts by choosing two binary polynomials, a CRC generating polynomial (hereinafter “CRC polynomial”), g_(l)(x), and a flip polynomial f_(l)(x). CRC polynomial g_(l)(x) has an order of l, and flip polynomial f_(l)(x) has an order of l−1, wherein l is an integer. In one aspect, gcd(g_(l)(x),x^(i))=1 for each and every 0≦i≦l, wherein i is an integer, and gcd(g_(l)(x),x^(i)) is the greatest common divider of g_(l)(x) and x^(i). Examples of suitable g_(l)(x) include g₄(x)=x⁴+x³+x²+x+1 for l=4; g₇(x)=x⁷+x⁶+x⁴+1 for l=7; g₈(x)=x⁸+x⁷+x⁴+x³+x+1 for l=8; and g₁₂(x)=x¹²+x¹¹+x³+x²+x+1 for l=12. Flip polynomial f_(l)(x) may be expressed as f_(l)(x)=f_(l−1)x^(l−1)+f_(l−2)x^(l−2)+ . . . +f₀, wherein f_(i)∈{0,1} for 0≦i≦l. The coefficients of flip polynomial f_(l)(x), namely, f_(l−1), f_(l−2), . . . , f₀, may be referred to as flip bits. The information of CRC polynomial g_(l)(x) and flip polynomial f_(l)(x) is stored in both the transmitter and the receiver.

For illustration purposes, a binary bit stream A is said to satisfy the CRC condition if g_(l)(x) divides A(x), or g_(l)(x)|A(x); and two binary bit streams A and B are said to satisfy the CRC condition if g_(l)(x) divides x^(s)A(x)+B(x), or g_(l)(x)|(x^(s)A(x)+B(x)), wherein s is the number of bits contained in bit stream B.

On the transmitter side, an encoding process first generates a parity check bit stream P including l parity check bits, or CRC bits, p_(l−1), p_(l−2), . . . , p₀, such that M and P satisfy the CRC condition, or g_(l)(x)|(x^(l)M(x)+P(x)), wherein M(x)=m_(k−1)x^(k−1)+m_(k−2)x^(k=)+ . . . +m₀, and P(x)=p_(l−1)x^(l−1)+p_(l−2)x^(l−2)+ . . . + p₀. Parity check bit stream P may also be referred to as a parity check block, a parity block, or a CRC block. One skilled in the art will now appreciate that each message block M corresponds to only one unique parity check bit stream P.

The encoding process then flips the parity check bits according to flip polynomial f_(l)(x), or, specifically, by performing a modulo-2 addition of each bit in the parity check bit stream P and a corresponding flip bit. The resultant flipped parity check bit stream P thus includes l flipped parity check bits: p_(l-1) =p_(l−1)+f_(l−1), p_(l−2) =p_(l−2)+f_(l−2), . . . , p₀ =p₀+f₀. In effect, if f_(i)=1, then p_(i) is the flip of p_(i); if f₀=1, then p_(i) is the same as p_(i).

Then, the flipped parity check bits are appended to the end of the message block to form a concatenated bit stream C including k+l bits, m_(k−1), m_(k−2), . . . , m₀, p_(l−1) , p_(l−2) , . . . , p₀ .

Consistent with the present invention, the flipped parity check bits may be generated through hardware or software. FIG. 6 illustrates a first hardware implementation for generating the flipped parity check bits consistent with the present invention. Referring to FIG. 6, a feedback shift register circuit 600 is used for generating flipped parity check bit stream P based on CRC generating polynomial g_(l)(x)=x⁸+x⁷+x⁴+x³+x+1. Circuit 600 includes a plurality of delay circuits 602, which may be implemented as flip-flops. The number of delay circuits 602 is equal to the order of g_(l)(x), i.e., l=8. Thus, in FIG. 6, there are 8 delay circuits, 602 ₁, 602 ₂, . . . , 602 ₈. Several XOR gates 604 are inserted between delay circuits 602. Each XOR gate 604 corresponds to a coefficient of CRC generating polynomial g_(l)(x). For example, as shown in FIG. 6, an XOR gate 604 ₁ to the left side of the first delay circuit 602 ₁ indicates that the coefficient of x⁰=1 of g_(l)(x) is 1; the absence of XOR gate 604 between delay circuits 602 ₂ and 602 ₃ indicates that the coefficient of x² of g_(l)(x) is 0; and an XOR gate 604 ₅ between delay circuits 602 ₇ and 602 ₈ indicates that the coefficient of x⁷ of g_(l)(x) is 1. An XOR gate 604 ₆ is also coupled XOR the output of delay circuit 602 ₈ with the message block M followed by flip bits f_(l−1), f_(l−2), . . . , f₀. According to the expression for f_(l)(x) previously described and as shown in FIG. 6, f₈(x)=x⁷+1. Thus, the corresponding 8 flip bits are 10000001. A clock signal (not shown) shifts register circuit 600 from left to right one bit at a time. Also shown in FIG. 6 is that the output of XOR gate 604 ₆ is fed back to each of XOR gates 604 ₁–604 ₅. A switch 606 switches the output of feedback shift register circuit 600 between message block M and the output of XOR gate 604 ₆. Feedback shift register circuit 600 first outputs message block M and then outputs the flipped parity bits by switching switch 606 to the output of XOR gate 604 ₆.

A second hardware implementation for generating flipped parity check bit stream P consistent with the present invention is illustrated in FIG. 7. As shown in FIG. 7, a feedback shift register circuit 700 includes a plurality of delay circuits 702, each of which may be implemented as a flip-flop circuit. Several XOR gates 704 are inserted between delay circuits 702 according to CRC generating polynomial g_(l)(x). Two XOR gates 704 ₁ and 704 ₂ are added to the left and right ends of circuit 700, respectively. The message block M is input into XOR gate 704 ₁, and the rightmost delay circuit 702 outputs message block M and its corresponding parity check bit stream P. XOR gate 704 ₂ then flips the parity check bit stream P using the flip bits, f_(l−1), f_(l−2), . . . , f₀, to generate the flipped parity check bit stream P. It is also assumed in FIG. 7 that the flip polynomial is f₈(x)=x⁷+1, and therefore the flip bits are 10000001.

FIG. 8 diagrammatically illustrates a software implementation of generating flipped parity check bit stream P, wherein a lookup table is used in the software implementation. The lookup table contains an entire list of CRC bit streams for all possible messages of a certain length. For example, when l=8, the lookup table includes 2⁸=256 entries of CRC bit streams, each bit stream containing eight binary bits. As shown in FIG. 8, a message including 3 bytes (24 bits), Byte 1, Byte 2, and Byte 3, is encoded using the lookup table. At step 802, Byte 1 is considered and the lookup table is searched for a matching entry for Byte 1. An XOR operation is performed on the outcome of the search and Byte 2 at step 804 to generate an intermediate CRC bit stream CRC 2. An entry that matches CRC2 is looked up in the lookup table (step 806) and is XOR'ed with Byte 3 (step 808), to generate the CRC bit stream, CRC 3, of the message. Further, CRC 3 is flipped using the flip bits. It is also assumed in FIG. 8 that the flip polynomial is f₈(x)=x⁷+1, and therefore the flip bits are 10000001.

As discussed above and shown in FIGS. 6–8, the generation of the flipped parity check bits consistent with the present invention can be easily implemented. With the exception that the second hardware implementation as shown in FIG. 7 may have approximately the same complexity as a similar implementation of DoCoMo's modification, implementations of DoCoMo's modification are generally much more complex than those consistent with the present invention and the standard CRC method.

The same encoding process as above is performed to generate a concatenated bit stream for each of the other message blocks in the message, and a data bit stream including the resultant concatenated bit streams in series is transmitted.

When the receiver receives a data bit stream including at least one concatenated bit stream, a decoding process is performed to identify the first message block in the data bit stream. After the first message block is identified, the first message block and its corresponding flipped parity check bit stream are removed from the data bit stream, and the receiver continues to identify the first message block in the resultant data bit stream. Thus, when the receiver starts to decode message block M, the data bit stream includes m_(k−1), m_(k−2), . . . , m₀, p_(l−1) , p_(l−2) , . . . , p₀ , followed by the concatenated bit streams of the next message blocks.

Because the receiver does not know the actual length of message block M, a block length {circumflex over (k)} is guessed. In one aspect, the initial value of {circumflex over (k)} is chosen to be small enough to ensure {circumflex over (k)}≦k. The receiver treats the first {circumflex over (k)} bits in the bit stream, m_(k−1), m_(k−2), . . . , m_(k-{circumflex over (k)}), as constituting a message block M′, and the following l bits, m_(k-{circumflex over (k)}−1), m_(k-{circumflex over (k)}−2), . . . , m₀, p_(l−) , p_(l−2) , . . . , p_(k-{circumflex over (k)}) , as constituting the corresponding flipped parity check bit stream P′. The receiver then performs the CRC test as follows.

First, a parity check bit stream {circumflex over (P)} including l parity check bits, {circumflex over (p)}_(l−1), {circumflex over (p)}_(l−2), . . . , {circumflex over (p)}₀, is generated for the guessed message block M′ such that g_(l)(x)|(x^(l)M′(x)+{circumflex over (P)}(x)). Second, using flip polynomial f_(l)(x), the parity check bit stream {circumflex over (P)} is flipped to generate a flipped parity check bit stream {circumflex over (P)}′, which includes l flipped parity check bits, {circumflex over (p)}′_(l−1)={circumflex over (p)}_(l−1)+f_(l−1), {circumflex over (p)}′_(l−2)={circumflex over (p)}_(l−2)+f_(l−2), . . . , {circumflex over (p)}′₀={circumflex over (p)}₀+f₀. Finally, the receiver compares the flipped parity check bit stream {circumflex over (P)}′ with the guessed flipped parity check bit stream P′. If {circumflex over (P)}′= P′, the CRC test is passed, it is considered that a message block has been correctly identified; the first {circumflex over (k)}+l bits in the bit stream, i.e., message block M′ and the flipped parity check bit stream P′, are removed from the data bit stream; and the receiver continues to decode the first message block in the resultant data bit stream. Otherwise, if {circumflex over (P)}′≠ P′, no message block has been identified, the estimated block length {circumflex over (k)} is increased by 1, and the above test is repeated.

By choosing a proper flip polynomial f_(l)(x), the CRC method of the present invention may have a low probability of false detection. In one aspect, flip polynomial f_(l)(x) is chosen such that

$\begin{matrix} {{{\deg\left( {{remainder}\mspace{14mu}{{of}\left( \frac{\left( {1 + x^{i}} \right){f_{l}(x)}}{g_{l}(x)} \right)}} \right)} \geq i},{{{for}\mspace{14mu} 1} \leq i \leq {l - 1.}}} & (2) \end{matrix}$ For example, when l=8 and g_(l)(x)=x⁸+x⁷+x⁴+x³+x+1, a possible flip polynomial that satisfies condition (2) is f_(l)(x)=x⁷+1.

Under condition (2) and the assumptions of an error-free transmission and a uniformly distributed message, CRC methods consistent with the present invention have a zero probability of false detection for any message length offset _(i) less than the number of CRC bits, _(l). In particular, the probability of false detection is given in Expression (3):

${P_{F}(i)} = \left\{ \begin{matrix} {0,} & {{{{for}\mspace{14mu} 0} \leq i \leq {l - 1}};} \\ {2^{- i},} & {{{{for}\mspace{14mu} i} \geq l},} \end{matrix} \right.$ if, and only if,

$\begin{matrix} {{{\deg\left( {{remainder}\mspace{14mu}{{of}\left( \frac{\left( {1 + x^{i}} \right){f_{l}(x)}}{g_{l}(x)} \right)}} \right)} \geq i},{{{for}\mspace{14mu} 1} \leq i \leq {l - 1}},} & (3) \end{matrix}$ wherein i=k−{circumflex over (k)} is the message length offset. A brief proof of Expression (3) is given below.

When i=0, the guessed message block M′ includes k bits, M_(k−1), m_(k−2), . . . , m₀, and the corresponding flipped parity check block P′ includes l bits, p_(l−1) , p_(l−2) , . . . , p₀ . The correct message block is identified, CRC condition is satisfied, and there is no false detection.

For 1≦i≦l, the wrongly guessed message block M′ includes k−1 bits, m_(k−1), m_(k−2), . . . , m_(i), and the wrongly guessed flipped parity check bit stream P′ includes l bits, m_(i−1), m_(i−2), . . . , m₀, p_(i-1) , p_(l-2) , . . . , p_(i) . The corresponding guessed parity check bit stream P′ is the flip of P′, or, P′(x)= P′(x)+f_(l)(x). The CRC test thus determines whether g_(l)(x)|C′(x), wherein

$\begin{matrix} {{C^{\prime}(x)} = {{x^{l}{M^{\prime}(x)}} + {P^{\prime}(x)}}} \\ {= {{m_{k - 1}x^{l + \hat{k} - 1}} + {m_{k - 2}x^{l + \hat{k} - 2}} + \ldots + {m_{0}x^{l - i}} +}} \\ {{\overset{\_}{p_{l - 1}}x^{l - i - 1}} + \ldots + \overset{\_}{p_{i}} + {{f_{l}(x)}.}} \end{matrix}$ Comparing C(x) with C(x)=x^(l)M(x)+P(x), there is

${C(x)} = {{\left( {{C^{\prime}(x)} + {f_{l}(x)}} \right)x^{i}} + {\sum\limits_{j = 0}^{i - 1}{\overset{\_}{p_{j}}x^{j}}} + {{f_{l}(x)}.}}$ Since g_(l)(x)|C(x) and gcd(g_(l)(x),x^(i))=1, g_(l)(x)|C′(x) is satisfied if and only if

${g_{l}(x)}❘{\left( {{\left( {1 + x^{i}} \right){f_{l}(x)}} + {\sum\limits_{j = 0}^{i - 1}{\overset{\_}{p_{j}}x^{j}}}} \right).}$ But because

${{\deg\left( {\sum\limits_{j = 0}^{i - 1}{\overset{\_}{p_{j}}x^{j}}} \right)} < i},$ and

${\deg\left( {{remainder}\mspace{14mu}{{of}\left( \frac{\left( {1 + x^{i}} \right){f_{l}(x)}}{g_{l}(x)} \right)}} \right)} \geq i$ (condition (2) above),

${{\deg\left( {{remainder}\mspace{14mu}{{of}\left( \frac{\left( {{\left( {1 + x^{i}} \right){f_{l}(x)}} + {\sum\limits_{j = 0}^{i - 1}{\overset{\_}{p_{j}}x^{j}}}} \right)}{g_{l}(x)} \right)}} \right)} \geq i},$ and g_(l)(x) does not divide

${\left( {1 + x^{i}} \right){f_{l}(x)}} + {\sum\limits_{j = 0}^{i - 1}{\overset{\_}{p_{j}}{x^{j}.}}}$ Therefore, the probability of a false detection is 0 when 1≦i≦l−1 and

${\deg\left( {{remainder}\mspace{14mu}{{of}\left( \frac{\left( {1 + x^{i}} \right){f_{l}(x)}}{g_{l}(x)} \right)}} \right)} \geq {i.}$

If i≧1, then the guessed message block M′ includes k−i bits, m_(k−1), m_(k−2), . . . , m_(i), and the guessed flipped parity check block P′ includes, m_(i−1), m_(i−2), . . . , m_(i−1). Because, as mentioned above, there is only one possible parity check block corresponding to a certain message block M′, there is only one possible flipped parity check block that corresponds to message block M′. Therefore, assuming message block M is uniformly distributed, the probability of m_(i−1), m_(i−2), . . . , m_(i−l) composing the flipped check parity block P′ that corresponds to M′, i.e., the probability of a false detection, is 2^(−l).

FIG. 9 shows a simulation result of the probability of passing the CRC test for the CRC method consistent with the present invention as compared to the standard CRC method and the DoCoMo's Modification method, wherein the diamond shape symbols represent the standard CRC method, the “+” symbols represent the DoCoMo's Modification method, and the square symbols represent the method consistent with the present invention. The order of the CRC generating polynomial is 8 and the actual message length is 15. Particularly, for the simulation shown in FIG. 9, g_(l)(x)=x⁸+x⁷+x⁴+x³+x+1, and f_(l)(x)=x⁷+1. As shown in FIG. 9, as the estimated message size approaches the actual message length, i.e., the length offset i approaches 0, the probability of passing the CRC test increases exponentially for the standard CRC method, and remains about the same (at 2⁻⁸) for the DoCoMo's Modification method. For the method consistent with the present invention, the probability of false detection is 2⁻⁸ when the message length offset is greater than or equal to 8 (i.e., the estimated message length is less than or equal to 7), and is 0 when the message length offset is less than 8. When the estimated message length is 15, i.e., the correct message block is identified, the probability of passing the CRC test is 1, and there is no false detection.

It will be apparent to those skilled in the art that various modifications and variations can be made in the disclosed process without departing from the scope or spirit of the invention. Other embodiments of the invention will be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the invention being indicated by the following claims. 

1. A method for a variable-length communications system, wherein messages to be transmitted are divided into variable-length message blocks, the method comprising: providing a cyclic redundancy check (CRC) generating polynomial g_(l)(x), wherein l is an integer and is the order of g_(l)(x); providing a binary flip polynomial f_(l)(x) having an order of l−1, wherein f_(l)(x)=f_(l−1)x^(l−1)+f_(l−2)x^(l−2)+ . . . +f₀; and encoding a message block M of a message to be transmitted, wherein M includes k binary bits, m_(k−1), m_(k−2), . . . , m₀, and wherein encoding M includes generating a parity check bit stream P, wherein P includes l parity check bits, p_(l−1), p_(l−2), . . . , p₀, such that g_(l)(x)|(x^(l)M(x)+P(x)), wherein M(x)=m_(k−1)x^(k−1)+m_(k−2)x^(k−2) + . . . +m₀, and P(x)=p_(l−1)x^(l−1)+p_(l−2)x^(l−2)+ . . . + p_(0,) flipping the parity check bit stream P to generate a flipped parity check bit stream P including l flipped parity check bits p_(l−) , p_(l−2) , . . . , p₀ , such that p_(l−1) =p_(l−1)+f_(l−1), p_(l−2) =p_(l−2)+f_(l−2), . . . , p₀ =p₀+f₀, wherein “+”is a modulo-2 addition operation, and appending the flipped parity check bit stream P to the end of message block M to create a concatenated bit stream C, such that C includes k+1 bits, m_(k−1), m_(k−2), . . . , m₀, p_(l−1) , p_(l−2) , . . . , p₀ .
 2. The method of claim 1, wherein CRC generating polynomial g_(l)(x) is chosen such that gcd(g_(l)(x),x^(i))=1 for 0≦i≦l, wherein i is an integer.
 3. The method of claim 1, wherein flip polynomial f_(l)(x) is chosen such that ${{\deg\left( {{remainder}\mspace{14mu}{{of}\left( \frac{\left( {1 + x^{i}} \right){f_{l}(x)}}{g_{l}(x)} \right)}} \right)} \geq i},$ for 1≦i≦l−1, wherein i is an integer.
 4. The method of claim 1, further comprising repeating the encoding to create a concatenated bit stream for each message block of the messages to be transmitted and transmitting the concatenated bit streams in series.
 5. A method for a variable-length communications system, wherein the system includes a receiver, the method comprising: storing in the receiver information of a cyclic redundancy check (CRC) generating polynomial g_(l)(x), wherein l is an integer and is the order of g_(l)(x), and information of a flip polynomial f_(l)(x) having an order of l−1; receiving a data bit stream including a plurality of concatenated bit streams, each concatenated bit stream consisting of a message block and a corresponding flipped parity check bit stream; and identifying a first message block in the data bit stream, including (a) guessing a message block length {circumflex over (k)} and a message block M′ consisting of the first {circumflex over (k)} bits in the data bit stream, m_(k̂ − 1)^(′), m_(k̂ − 2)^(′), …  , m₀^(′), wherein {circumflex over (k)} is an integer, and wherein l bits in the data bit stream that immediately follow the message block M′ compose a guessed flipped bit stream P′, (b) generating a parity check bit stream {circumflex over (P)} including l parity check bits, {circumflex over (p)}_(l−1), {circumflex over (p)}_(l−2), . . . , {circumflex over (p)}₀, such that g_(l)(x)|(x^(l)M′(x)+{circumflex over (P)}(x)), wherein M^(′)(x) = m_(k̂ − 1)^(′)x^(k̂ − 1) + m_(k̂ − 2)^(′)x^(k̂ − 2) + ⋯ + m₀^(′), and P̂(x) = p̂_(l − 1)x^(l − 1) + p̂_(l − 2)x^(l − 2) + ⋯ + p̂₀, (c) flipping the parity check bit stream {circumflex over (P)} using flip polynomial f_(l)(x) to generate a flipped parity check bit stream {circumflex over (P)}′ including l flipped parity check bits, {circumflex over (p)}′_(l−1), {circumflex over (p)}′_(l−2), . . . , p′₀, and (d) if P′ and {circumflex over (P)}′ are different, increasing {circumflex over (k)} by 1 and repeating (a)–(c).
 6. The method of claim 5, wherein CRC generating polynomial g_(l)(x) satisfies gcd(g_(l)(x),x^(i))=1 for 0≦i≦l, wherein i is an integer.
 7. The method of claim 5, wherein flip polynomial f_(l)(x) satisfies ${{\deg\left( {{remainder}\mspace{14mu}{{of}\left( \frac{\left( {1 + x^{i}} \right){f_{l}(x)}}{g_{l}(x)} \right)}} \right)} \geq i},$ for 1≦i≦l−1, wherein i is an integer.
 8. The method of claim 5, wherein the length of the first message block is k, wherein k is an integer, and the initial value of {circumflex over (k)} is not greater than k.
 9. The method of claim 5, wherein the flipped parity check bit stream {circumflex over (P)}′ is generated such that p̂_(l − 1)^(′) = p̂_(l − 1) + f_(l − 1), p̂_(l − 2)^(′) = p̂_(l − 2) + f_(l − 2), …  , p̂₀^(′) = p̂₀ + f₀, wherein “+” is a modulo-2 addition operator.
 10. The method of claim 5, wherein identifying the first message block further comprising removing the first {circumflex over (k)}+l bits from the data bit stream when P′={circumflex over (P)}′.
 11. The method of claim 10, further comprising repeating identifying the first message block in the data bit stream after the first {circumflex over (k)}+l bits are removed.
 12. A method for a variable-length communications system, wherein the system includes a transmitter and a receiver, wherein messages are divided into variable-length message blocks, comprising: providing a cyclic redundancy check (CRC) generating polynomial g_(l)(x), wherein l is an integer and is the order of g_(l)(x); providing a binary flip polynomial f_(l)(x) having an order of l−1; storing in both the transmitter and the receiver information of CRC generating polynomial g_(l)(x) and information of flip polynomial f_(l)(x); encoding a message to be transmitted by encoding each message block M thereof, wherein encoding M includes generating a parity check bit stream P using the CRC generating polynomial g_(l)(x), flipping the parity check bit stream P to generate a flipped parity check bit stream P using flip polynomial f_(l)(x), and appending the flipped parity check bit stream P to the end of the message block M to create a concatenated bit stream C; and transmitting the concatenated bit streams C of the message blocks M of the message to be transmitted; receiving a data bit stream including a plurality of concatenated bit streams, each concatenated bit stream consisting of a message block and a corresponding flipped parity check bit stream; and decoding the data bit stream, including identifying a first message block in the data bit stream, including (a) guessing a message block length {circumflex over (k)} and a message block M′ consisting of the first {circumflex over (k)} bits in the data bit stream, m_(k̂ − 1)^(′), m_(k̂ − 2)^(′), …  , m₀^(′),  wherein {circumflex over (k)} is an integer, and wherein l bits in the data bit stream that immediately follow the message block M′ compose a guessed flipped bit stream P′, (b) generating a parity check bit stream {circumflex over (P)} using CRC generating polynomial g_(l)(x), (c) flipping the parity check bit stream {circumflex over (P)} using flip polynomial f_(l)(x) to generate a flipped parity check bit stream {circumflex over (P)}′, (d) if P′ and {circumflex over (P)}′ are different, increasing {circumflex over (k)} by 1 and repeating (a)–(c), and (e) removing the first {circumflex over (k)}+l bits from the data bit stream when P′={circumflex over (P)}′, and repeating the identifying of the first message block in the data bit stream after the first {circumflex over (k)}+l bits are removed.
 13. The method of claim 12, wherein the CRC generating polynomial g_(l)(x) is chosen such that gcd(g_(l)(x),x^(i))=1 for 0≦i≦l, wherein i is an integer.
 14. The method of claim 13, wherein the parity check bit stream {circumflex over (P)} includes l bits, {circumflex over (p)}_(l−1), {circumflex over (p)}_(l−2), . . . , {circumflex over (p)}₀, and is generated such that g_(l)(x)|(x^(l)M′(x)+{circumflex over (P)}(x)), wherein M^(′)(x) = m_(k̂ − 1)^(′)x^(k̂ − 1) + m_(k̂ − 2)^(′)x^(k̂ − 2) + … + m₀^(′), and P̂(x) = p̂_(l − 1)x^(l − 1) + p̂_(l − 2)x^(l − 2) + … + p̂₀.
 15. The method of claim 12, wherein flip polynomial f_(l)(x) is chosen such that ${{\deg\left( {{remainder}\mspace{14mu}{of}\mspace{14mu}\left( \frac{\left( {1 + x^{i}} \right){f_{l}(x)}}{g_{l}(x)} \right)} \right)} \geq i},$ for 1≦i≦l−1, wherein i is an integer.
 16. The method of claim 15, wherein the parity check bit stream {circumflex over (P)} includes l bits, {circumflex over (p)}_(l−1), {circumflex over (p)}_(l−2), . . . , {circumflex over (p)}₀, wherein the flipped parity check bit stream includes {circumflex over (P)}′ including l flipped parity check bits, p̂_(l − 1)^(′), p̂_(l − 2)^(′), …  , p̂₀^(′), and wherein the flipped parity check bit stream {circumflex over (P)}′ is generated such that p̂_(l − 1)^(′) = p̂_(l − 1) + f_(l − 1), p̂_(l − 2)^(′) = p̂_(l − 2) + f_(l − 2), …  , p̂₀^(′) = p̂₀ + f₀, wherein “+” is a modulo-2 addition operator.
 17. The method of claim 12, wherein the length of the first message block in the data bit stream is k, wherein k is an integer, and the initial value of {circumflex over (k)} is not greater than k. 